Voronoi-Dickson Hypothesis on Perfect Forms and L-types

نویسندگان

  • Robert Erdahl
  • Konstantin Rybnikov
چکیده

George Voronoi (1908, 1909) introduced two important reduction methods for positive quadratic forms: the reduction with perfect forms, and the reduction with Ltype domains, often called domains of Delaunay type. The first method is important in studies of dense lattice packings of spheres. The second method provides the key tools for finding the least dense lattice coverings with equal spheres in lower dimensions. In his investigations Voronoi heavily relied on that in dimensions less than 6 the partition of the cone of positive quadratic forms into L-types refines the partition of this cone into perfect domains. Voronoi conjectured implicitely and Dickson (1972) explicitely that the L-partition is always a refinement of the partition into perfect domains. This was proved for n ≤ 5 (Voronoi, Delaunay, Ryshkov, Baranovskii). We show that Voronoi-Dickson conjecture fails already in dimension 6.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Voronoi’s two tilings of the cone of metrical forms

In his last two papers Georges Voronoi introduced two tilings for the cone of metrical forms for lattices, the tiling by perfect domains and the tiling by lattice type domains. Both are facet-to-facet tilings by polyhedral subcones, and invariant with respect to the natural action of GL(n, Z) on Sym(n, R). In working out the details of his theory of lattice types, his most important legacy for ...

متن کامل

A SUFFICIENT CONDITION FOR AN EXTREME COVERING OF n-SPACE BY SPHERES

The problem of finding the most economical coverings of M-dimensional Euclidean space by equal spheres whose centres form a lattice, which is equivalent to a problem concerning the inhomogeneous minima of positive definite quadratic forms, has been discussed recently by Barnes and Dickson [1]. The reader is referred to [1] for a complete background on the problem. Terms and notations used will ...

متن کامل

Dual Cones and the Voronoi Algorithm

Almost a century ago Voronoi [1908] formulated his fundamental algorithm to find the perfect (real positive definite quadratic) forms in n variables. Among these one finds the forms representing the locally extreme lattice packings of spheres. The subject was taken up by M. Koecher [1960], who gave an axiomatic treatment of self-dual cones and a corresponding Voronoi algorithm in this situation...

متن کامل

An Infinite Series of Perfect Quadratic Forms and Big Delaunay Simplexes in Z

Georges Voronoi (1908-09) introduced two important reduction methods for positive quadratic forms: the reduction with perfect forms, and the reduction with L-type domains. A form is perfect if it can be reconstructed from all representations of its arithmetic minimum. Two forms have the same L-type if Delaunay tilings of their lattices are affinely equivalent. Delaunay (1937-38) asked about pos...

متن کامل

Enumerating Perfect Forms

A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in d variables up to arithmetical equivalence and scaling. We put an emphasis on practical issues concerning computer assisted enumerations. For the necessary theory of Vorono...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001